Separation network design with mass and energy separating agents
نویسندگان
چکیده
منابع مشابه
Separation network design with mass and energy separating agents
The mathematical model developed in this paper deals with simultaneous synthesis of the integrated separation network, where both mass separating agents (MSAs) and energy separating agents (ESAs) are taken into account. The proposed model formulation is believed to be superior to the available ones. Traditionally, the tasks of optimizing ESA-based and MSA-based processes were either performed i...
متن کاملNetwork Design with Selfish Agents
Think of sea transport companies or broadband internet providers each company needs to connect a few ports or users every connection has a constant cost connection is bought if all together pay for it no additional utility Network Design with Selfish Agents – p.3
متن کاملNetwork Design and Management with Strategic Agents
Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of self-interested agents who want to form a network connecting certain endpoints, the set of stable solutions (the Nash equilibria) may look quite different from the centrally enforced optimum. We study the price of stability, i.e., the quality of the best Nash ...
متن کاملFrequency separation by an excitatory-inhibitory network: separating frequencies
We consider a situation in which individual features of the input are represented in the neural system by different frequencies of periodic firings. Thus, if two of the features are presented concurrently, the input to the system will consist of a superposition of two periodic trains. In this paper we present an algorithm that is capable of extracting the individual features from the composite ...
متن کاملGeometric Network Design with Selfish Agents
We study a geometric version of a simple non-cooperative network creation game introduced in [2], assuming Euclidean edge costs on the plane. The price of anarchy in such geometric games with k players is Θ(k). Hence, we consider the task of minimizing players incentives to deviate from a payment scheme, purchasing the minimum cost network. In contrast to general games, in small geometric games...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2011
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2010.10.013